Analytical Results on the Quadtree Storage-Requirements
نویسندگان
چکیده
An analysis of the expected size occupied by a Quadtree is presented. The analysis is based on the general assumption that the storage requirements of internal and external nodes differ. Besides, formulae for the expected number of internal and external nodes at a specific level of the tree are given. Next, the space efficiency of the most popular Quadtree implementations is examined. Finally, the possible usefulness of these analytical tools in other problems is commented.
منابع مشابه
Analytical Comparison of Two Spatial Data Structures
Region Quadtrees and Bintrees are two structures used in GIS and spatial databases. The expected space performances of these two trees are presented and compared. Analysis is based on the general assumption that the storage requirements of internal and external nodes differ, as well as on a parametric model of binarv random images. Initiallv. formulae that exnress the averaee total storage perf...
متن کاملGeneralized comparison of quadtree and bintree storage requirements
The quadtree and the bintree data structures are two variants on the principle of hierarchical regular decomposition applied to image representation. A comparison of the storage requirements for images represented by these two methods is presented. The relative storage efficiency of quadand bintrees is determined by two factors: the relative node sizes for the two representations as determined ...
متن کاملQuadtree and Octree Grid Generation
Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...
متن کاملQuadtree Based Variable Rate Oriented Mean Shape-Gain Vector Quantization
Mean shape-gain vector quantization (MSGVQ) is extended to include negative gains and square isometries. Square isometries together with a classi cation technique based on average block intensities enable us to enlarge the MSGVQ codebook size without any additional storage requirements while keeping the complexity of both the codebook generation and the encoding manageable. Variable rate codes ...
متن کاملEecient Window Block Retrieval in Quadtree-based Spatial Databases 1
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving all of the quadtree blocks in the underlying spatial database that cover the quadtree blocks that comprise the window. It works by decomposing the window operation into sub-operations over smaller window partitions. These partitions are the quadtree blocks corresponding to the windo...
متن کامل